例句與造句

1. To these ends, a number of alternative implementation schemes have been devised for the Cooley Tukey algorithm that do not require separate bit reversal and / or involve additional permutations at intermediate stages.
2. Zero's bit reversal is still zero; it can be divided by 2 any number of times, and its binary expansion does not contain any 1s, so it always comes first.
3. But the reciprocal polynomial is not the same as the original polynomial, and the CRCs generated using it are not the same ( even modulo bit reversal ) as those generated by the original polynomial.
4. Alternatively, some applications ( such as convolution ) work equally well on bit-reversed data, so one can perform forward transforms, processing, and then inverse transforms all without bit reversal to produce final results in the natural order.
5. :: : These encoding objects apply mostly to simple ECN types, and have several parameters specifying the bit-level encoding of a value, the size of the encoding, any preceding or trailing padding, any alignment to an octet or word boundary, any bit reversals, etc.
6. It's difficult to find bit reversal in a sentence. 用bit reversal造句挺難的
7. I place few bits as marker in front of this audio data to denote the reciver the starting point of my data since data has to be exactly placed in lch and rch of the codec . a single bit reversal or mis-match causes serious noise . Now what happens is that data bits sometimes happen to be the marker value and mimic the marker.
8. Many FFT users, however, prefer natural-order outputs, and a separate, explicit bit-reversal stage can have a non-negligible impact on the computation time, Also, while the permutation is a bit reversal in the radix-2 case, it is more generally an arbitrary ( mixed-base ) digit reversal for the mixed-radix case, and the permutation algorithms become more complicated to implement.
9. And for next recursive stage, those 4 least significant bits will become " b " 1 " b " 4 " b " 3 " b " 2, If you include all of the recursive stages of a radix-2 DIT algorithm, " all " the bits must be reversed and thus one must pre-process the input ( " or " post-process the output ) with a bit reversal to get in-order output . ( If each size-" N " / 2 subtransform is to operate on contiguous data, the DIT " input " is pre-processed by bit-reversal . ) Correspondingly, if you perform all of the steps in reverse order, you obtain a radix-2 DIF algorithm with bit reversal in post-processing ( or pre-processing, respectively ).
10. And for next recursive stage, those 4 least significant bits will become " b " 1 " b " 4 " b " 3 " b " 2, If you include all of the recursive stages of a radix-2 DIT algorithm, " all " the bits must be reversed and thus one must pre-process the input ( " or " post-process the output ) with a bit reversal to get in-order output . ( If each size-" N " / 2 subtransform is to operate on contiguous data, the DIT " input " is pre-processed by bit-reversal . ) Correspondingly, if you perform all of the steps in reverse order, you obtain a radix-2 DIF algorithm with bit reversal in post-processing ( or pre-processing, respectively ).